Combinatorics of integer partitions with prescribed perimeter
نویسندگان
چکیده
We prove that the number of even parts and times are repeated have same distribution over integer partitions with a fixed perimeter. This refines Straub's analog Euler's Odd-Distinct partition theorem. generalize two concerned statistics to those part-difference less than d not congruent 1 modulo d+1 inequality, has similar flavor as Alder's ex-conjecture, prescribed Both our results proven analytically combinatorially.
منابع مشابه
Combinatorics of Integer Partitions in Arithmetic Progression
The partitions of a positive integer n in which the parts are in arithmetic progression possess interesting combinatorial properties that distinguish them from other classes of partitions. We exhibit the properties by analyzing partitions with respect to a fixed length of the arithmetic progressions. We also address an open question concerning the number of integers k for which there is a k-par...
متن کاملPartitions with Prescribed Mean Curvatures
We consider a certain variational problem on Caccioppoli partitions with countably many components, which models immiscible fluids as well as variational image segmentation, and generalizes the well-known problem with prescribed mean curvature. We prove existence and regularity results, and finally show some explicit examples of minimizers. Introduction In this paper we consider a variational p...
متن کاملInteger Partitions with Fixed Subsums
Given two positive integers m ≤ n, we consider the set of partitions λ = (λ1, . . . , λ`, 0, . . . ), λ1 ≥ λ2 ≥ . . . , of n such that the sum of its parts over a fixed increasing subsequence (aj) is m: λa1 + λa2 + · · · = m. We show that the number of such partitions does not depend on n if m is either constant and small relatively to n or depend on n but is close to its largest possible value...
متن کاملInteger Partitions
Let denote the positive octant of the regular -dimensional cubic lattice. Each vertex (1 2 ) of is adjacent to all vertices of the form (1 2 + 1 ), 1 ≤ ≤ . A -partition of a positive integer is an assignment of nonnegative integers 12 to the vertices of , subject to both an ordering condition 12 ≥ max 1≤≤ 12+...
متن کاملLeast - Perimeter Partitions of the Sphere
We consider generalizations of the honeycomb problem to the sphere S and seek the perimeter-minimizing partition into n regions of equal area. We provide a new proof of Masters’ result that three great semicircles meeting at the poles at 120 degrees minimize perimeter among partitions into three equal areas. We also treat the case of four equal areas, and we prove under various hypotheses that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2023
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2023.105747